All minimum C5-saturated graphs
نویسنده
چکیده
A graph is C5-saturated if it has no five-cycle as a subgraph, but does contain a C5 after the addition of any new edge. Extending our previous result, we prove that the minimum number of edges in a C5-saturated graph on n vertices is sat(n, C5) = ⌈10(n − 1)/7⌉ − 1 for 11 ≤ n ≤ 14, or n = 16, 18, 20, and is ⌈10(n − 1)/7⌉ for all other n ≥ 5, and we also prove that the only C5-saturated graphs with sat(n, C5) edges are the graphs described in Section 2. §
منابع مشابه
Uniquely Cycle-Saturated Graphs
Given a graph F , a graph G is uniquely F -saturated if F is not a subgraph of G and adding any edge of the complement to G completes exactly one copy of F . In this paper we study uniquely Ct-saturated graphs. We prove the following: (1) a graph is uniquely C5-saturated if and only if it is a friendship graph. (2) There are no uniquely C6-saturated graphs or uniquely C7-saturated graphs. (3) F...
متن کاملGraphs Without Induced
Zverovich [Discuss. Math. Graph Theory 23 (2003), 159–162.] has proved that the domination number and connected domination number are equal on all connected graphs without induced P5 and C5. Here we show (with an independent proof) that the following stronger result is also valid: Every P5-free and C5-free connected graph contains a minimum-size dominating set that induces a complete subgraph.
متن کاملSize of weakly saturated graphs
Let P be a hereditary property. Let kP(G) denote the number of forbidden subgraphs, which are contained in G. A graph G is said to be weakly P-saturated, if G ∈ P and the edges of the complement of G can be labelled e1, e2, . . . , el in such way that for i= 0, 1, . . . , l− 1 the inequality kP(Gi+1)> kP(Gi) holds, whereG0=G,Gi+1=Gi + ei andGl =Kn. The minimum possible size of weakly P-saturate...
متن کاملThe Edge Spectrum of K4-Saturated Graphs
Any H-free graph G is called H-saturated if the addition of any edge e / ∈ E(G) results in H as a subgraph of G. The minimum size of an H-saturated graph on n vertices is denoted by sat(n,H). The edge spectrum for the family of graphs with property P is the set of all sizes of graphs with property P . In this paper, we find the edge spectrum of K4-saturated graphs. We also show that if G is a K...
متن کاملOn the Number of Edges in a Minimum C6-Saturated Graph
A graph is said to be Ck-saturated if it contains no cycles of length k but does contain such a cycle after the addition of any edge in the complement of the graph. Determining the minimum size of Ck-saturated graphs is one of the interesting problems on extremal graphs. The exact minimum sizes are known for k = 3, 4 and 5, but only general bounds are shown for k ≥ 6. This paper deals with boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 67 شماره
صفحات -
تاریخ انتشار 2011